115 research outputs found

    Towards Intelligent Databases

    Get PDF
    This article is a presentation of the objectives and techniques of deductive databases. The deductive approach to databases aims at extending with intensional definitions other database paradigms that describe applications extensionaUy. We first show how constructive specifications can be expressed with deduction rules, and how normative conditions can be defined using integrity constraints. We outline the principles of bottom-up and top-down query answering procedures and present the techniques used for integrity checking. We then argue that it is often desirable to manage with a database system not only database applications, but also specifications of system components. We present such meta-level specifications and discuss their advantages over conventional approaches

    Electromagnetically induced spatial light modulation

    Full text link
    We theoretically report that, utilizing electromagnetically induced transparency (EIT), the transverse spatial properties of weak probe fields can be fast modulated by using optical patterns (e.g. images) with desired intensity distributions in the coupling fields. Consequently, EIT systems can function as high-speed optically addressed spatial light modulators. To exemplify our proposal, we indicate the generation and manipulation of Laguerre-Gaussian beams based on either phase or amplitude modulation in hot vapor EIT systems.Comment: 8 pages, 3 figure

    Para to Ortho transition of metallic dimers on Si(001)

    Full text link
    Extensive electronic structure calculations are performed to obtain the stable geometries of metals like Al, Ga and In on the Si(001) surface at 0.5 ML and 1 ML coverages. Our results coupled with previous theoretical findings explain the recent experimental data in a comprehensive fashion. At low coverages, as shown by previous works, `Para' dimers give the lowest energy structure. With increasing coverage beyond 0.5 ML, `Ortho' dimers become part of low energy configurations leading toward a `Para' to `Ortho' transition at 1 ML coverage. For In mixed staggered dimers (`Ortho' and `Para') give the lowest energy configuration. For Ga, mixed dimers are non-staggered, while for Al `Para' to `Ortho' transition of dimers is complete. Thus at intermediate coverages between 0.5 and 1 ML, the `Ortho' and `Para' dimers may coexist on the surface. Consequently, this may be an explanation of the fact that the experimental observations can be successfully interpreted using either orientation. A supported zigzag structure at 0.5 ML, which resembles (CH)x{\rm (CH)_x}, does not undergo a dimerization transition, and hence stays semi-metallic. Also, unlike (CH)x{\rm (CH)_x} the soliton formation is ruled out for this structure.Comment: 8 pages, 6 figure

    A formal account of dishonesty

    Get PDF
    International audienceThis paper provides formal accounts of dishonest attitudes of agents. We introduce a propositional multi-modal logic that can represent an agent's belief and intention as well as communication between agents. Using the language, we formulate different categories of dishonesty. We first provide two different definitions of lies and provide their logical properties. We then consider an incentive behind the act of lying and introduce lying with objectives. We subsequently define bullshit, withholding information and half-truths, and analyze their formal properties. We compare different categories of dishonesty in a systematic manner, and examine their connection to deception. We also propose maxims for dishonest communication that agents should ideally try to satisfy

    Prioritized Repairing and Consistent Query Answering in Relational Databases

    Get PDF
    A consistent query answer in an inconsistent database is an answer obtained in every (minimal) repair. The repairs are obtained by resolving all conflicts in all possible ways. Often, however, the user is able to provide a preference on how conflicts should be resolved. We investigate here the framework of preferred consistent query answers, in which user preferences are used to narrow down the set of repairs to a set of preferred repairs. We axiomatize desirable properties of preferred repairs. We present three different families of preferred repairs and study their mutual relationships. Finally, we investigate the complexity of preferred repairing and computing preferred consistent query answers.Comment: Accepted to the special SUM'08 issue of AMA

    Computing Consensus: A Logic for Reasoning About Deliberative Processes Based on Argumentation

    Get PDF
    Argumentation theory can encode an agent’s assessment of the state of an exchange of points of view. We present a conservative model of multiple agents potentially disagreeing on the views presented during a process of deliberation. We model this process as iteratively adding points of view (arguments), or aspects of points of view. This gives rise to a modal logic, deliberative dynamic logic, which permits us to reason about the possible developments of the deliberative state. The logic we propose applies to all natural semantics of argumentation theory. Furthermore, under a very weak assumption that the consensus considered by a group of agents is faithful to their individual views, we show that model checking these models is feasible, as long as the argumentation frameworks, which may be infinite, does not have infinite branching.acceptedVersio

    The DLV System for Knowledge Representation and Reasoning

    Full text link
    This paper presents the DLV system, which is widely considered the state-of-the-art implementation of disjunctive logic programming, and addresses several aspects. As for problem solving, we provide a formal definition of its kernel language, function-free disjunctive logic programs (also known as disjunctive datalog), extended by weak constraints, which are a powerful tool to express optimization problems. We then illustrate the usage of DLV as a tool for knowledge representation and reasoning, describing a new declarative programming methodology which allows one to encode complex problems (up to Δ3P\Delta^P_3-complete problems) in a declarative fashion. On the foundational side, we provide a detailed analysis of the computational complexity of the language of DLV, and by deriving new complexity results we chart a complete picture of the complexity of this language and important fragments thereof. Furthermore, we illustrate the general architecture of the DLV system which has been influenced by these results. As for applications, we overview application front-ends which have been developed on top of DLV to solve specific knowledge representation tasks, and we briefly describe the main international projects investigating the potential of the system for industrial exploitation. Finally, we report about thorough experimentation and benchmarking, which has been carried out to assess the efficiency of the system. The experimental results confirm the solidity of DLV and highlight its potential for emerging application areas like knowledge management and information integration.Comment: 56 pages, 9 figures, 6 table

    Approximate OWL-Reasoning with Screech

    Get PDF
    Applications of expressive ontology reasoning for the Semantic Web require scalable algorithms for deducing implicit knowledge from explicitly given knowledge bases. Besides the development of more effi- cient such algorithms, awareness is rising that approximate reasoning solutions will be helpful and needed for certain application domains. In this paper, we present a comprehensive overview of the Screech approach to approximate reasoning with OWL ontologies, which is based on the KAON2 algorithms, facilitating a compilation of OWL DL TBoxes into Datalog, which is tractable in terms of data complexity. We present three different instantiations of the Screech approach, and report on experiments which show that a significant gain in efficiency can be achieved
    • 

    corecore